Generalized inverses under the l1-norm
نویسندگان
چکیده
منابع مشابه
Weighted isotonic regression under the L1 norm
Isotonic regression, the problem of finding values that best fit given observations and conform to specific ordering constraints, has found many applications in biomedical research and other fields. When the constraints form a partial ordering, solving the problem under the L1 error measure takes O(n) when there are n observations. The analysis of large-scale microarray data, which is one of th...
متن کاملPartial inverse assignment problems under l1 norm
In this paper, we consider the partial inverse assignment problem under l1 norm without bound constraints. We show that the partial inverse problem can be solved by a strongly polynomial algorithm. The technique for solving this problem can be extended to handle a special type of partial inverse 0.1 combinatorial optimization problems. © 2006 Elsevier B.V. All rights reserved.
متن کاملEfficient many-to-many feature matching under the l1 norm
Please cite this article in press as: M.F. Demirci e doi:10.1016/j.cviu.2010.12.012 Matching configurations of image features, represented as attributed graphs, to configurations of model features is an important component in many object recognition algorithms. Noisy segmentation of images and imprecise feature detection may lead to graphs that represent visually similar configurations that do ...
متن کاملMinimax Estimation of Large Covariance Matrices under l1-Norm
Driven by a wide range of applications in high-dimensional data analysis, there has been significant recent interest in the estimation of large covariance matrices. In this paper, we consider optimal estimation of a covariance matrix as well as its inverse over several commonly used parameter spaces under the matrix l1 norm. Both minimax lower and upper bounds are derived. The lower bounds are ...
متن کاملBest one-sided approximation of polynomials under L1 norm
In this paper, we develop an analytic solution for the best one-sided approximation of polynomials under L1 norm, that is, we 0nd two polynomials with lower degree which bound the given polynomial such that the areas between the bounding polynomials and the given polynomial attain minimum. The key ingredient of our technique is a characterization for one-sided approximations based on orthogonal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1987
ISSN: 0024-3795
DOI: 10.1016/0024-3795(87)90094-2